univers onlin cach algorithm base pattern match focu work aspect onlin comput address standard competit analysi identifi request sequenc trivial onlin algorithm versu request sequenc algorithm perform equal bad motiv work advanc system architectur design oper system dynam alloc resourc onlin protocol prefetch cach util featur oper system identifi data stream benefit resourc approach work base relat entropi compress gambl extens studi inform theori shown set entropi fulli partial character expect outcom iter gambl game goal studi extent entropi input character expect perform onlin algorithm problem aris comput applic studi bound base entropi classic onlin problem list access prefetch cach bound relat perform onlin algorithm entropi noisi constrain capac bsc channel abstract studi classic problem noisi constrain capac case binari symmetr channel bsc capac bsc input sequenc constrain set state calcul nois free capac constrain sequenc comput capac constraint presenc nois unsolv problem half centuri shannon landmark paper express constrain capac binari symmetr channel constrain input limit top lyapunov expon matrix random process comput asymptot approxim noisi constrain capac case nois paramet small show error term respect constraint capac log gt case comput coeffici error term establish find extend previou result entropi hidden markov process higher order finit memori process conclus prove combin analyt combinatori method introduct special issu inform theori molecular biologi neurosci tunstal code khodak variat random walk variabl fix length encod partit sourc string variabl length phrase belong fix dictionari tunstal independ khodak design variabl fix length code memoryless sourc optim constraint paper studi tunstal khodak code analyt inform theori machineri analysi algorithm literatur propos algebra character tunstal khodak code present result varianc central limit theorem dictionari phrase length analysi argument obtain asymptot result dictionari phrase length averag redund rate expect behavior digit search tree profil digit search tree dst fundament data structur word digit tree kei string word store directli intern node tree find myriad applic popular lempel ziv data compress scheme distribut hash tabl profil dst measur number node distanc root function number store string distanc root paramet dst height fill express term profil incept dst analysi profil elus promin open problem area analysi algorithm make decis step solv problem present precis analysi averag profil store string gener bias memoryless sourc main technic difficulti analyz profil li solv sophist recurr equat present solut poisson version problem number store string gener poisson distribut mellin transform domain accomplish introduc function oper multipl choic distribut hash tabl profil retriev popular data structur word pertin intern structur store word split procedur divers context profil trie paramet repres number node intern extern distanc root function number string store trie distanc root trie paramet height size depth shortest path fill level uniformli analyz extern intern profil profil repres fundament paramet studi past analysi profil surprisingli arduou carri reveal unusu intrigu interest behavior present detail studi distribut profil trie built random string gener memoryless sourc deriv recurr satisfi expect profil solv asymptot rang distanc root appear profil exhibit fascin phenomena move root leav trie growth expect profil vari root extern profil tend exponenti rate rate gradual rise logarithm extern profil abruptli tend infin logarithm profil retriev popular data structur word pertin intern structur store word split procedur divers context profil trie paramet repres number node intern extern distanc root function number string store trie distanc root trie paramet height size depth shortest path fill level uniformli analyz extern intern profil profil repres fundament paramet studi past analysi profil surprisingli arduou carri reveal unusu intrigu interest behavior present detail studi distribut profil trie built random string gener memoryless sourc deriv recurr satisfi expect profil solv asymptot rang distanc root appear profil exhibit fascin phenomena move root leav trie growth expect profil vari root extern profil tend exponenti rate rate gradual rise logarithm extern profil abruptli tend infin logarithm annot pathwai interact network integr molecular interact data exist knowledg molecular function reveal mechan underli cellular organ present narada softwar tool implement comprehens analysi suit function annot pathwai narada take input speci specif molecular interact network annot biomolecul network user set pathwai compos function attribut thought pathwai templat function annot space recur context group specif molecul similar function annot pattern molecular interact network narada underpin formal statist measur signific algorithm base perform comprehens evalu coli transcript regul proteinprotein interact data demonstr narada abil detect pathwai dto code anti dredund code shot code assign distinct codeword sourc symbol necessarili prefix code gener uniqu decod code aris exist end messag channel symbol interestingli wyner prove code averag code length smaller sourc entropi call differ anti redund author year shown anti redund big minu logarithm sourc entropi knowledg precis estim exist note block code length gener binari memoryless sourc prove averag anti redund log constant iflog irrat probabl gener fluctuat function code length increas simpl find requir combin sophist analyt tool precis evalu bernoulli sum saddl point method theori distribut sequenc modulo construct explicit khodak code analysi entropi hidden markov process studi entropi rate binari hidden markov process hmp defin observ output binari symmetr channel input order binari markov process simplic model involv character entropi long stand open problem present probabl sequenc model product random matric show entropi rate sought top lyapunov expon product explain di culti explicit comput appli product random matric deriv explicit express order taylor approxim entropi rate respect paramet binari symmetr channel accuraci approxim valid empir simul result extend result renyi entropi order function annot regulatori pathwai motiv standard annot biomolecul interact network gene ontolog provid comprehens understand function individu molecul extend annot pathwai critic compon function character cellular signal system level result propos framework project gene regulatori network space function attribut multigraph model object deriv statist signific pathwai annot demonstr annot pairwis interact gener indirect relationship process motiv result formal problem identifi statist repres pathwai function attribut establish hard problem demonstr monoton common statist signific measur propos statist model emphas modular pathwai evalu signific base coupl build block complement statist model effici algorithm softwar narada comput signific pathwai larg regulatori network comprehens result method appli coli transcript network demonstr approach effect identifi biolog pathwai annot avail narada implement java partial fillup search time lc identifi statist depend genom sequenc mutual inform estim wait time distribut pattern occurr constrain sequenc binari sequenc zero call sequenc run zero length greater arbitrari fix neg integ lt sequenc find abund applic commun magnet optic record occasion requir sequenc specif pattern distribut result pattern occurr sequenc interest paper studi distribut wait time occurr pattern random sequenc gener markov sourc numer exampl provid random leader elect investig durat elimin process identifi winner coin toss equival height random incomplet trie applic process includ elect leader comput network direct probabilist argument obtain exact express discret distribut moment height elementari approxim techniqu yield asymptot distribut show limit distribut exist asymptot express exhibit period fluctuat similar problem digit tree exact express deriv outlin power gener approach base analyt techniqu mellin transform poisson de poisson distribut asymptot height deriv fact complex variabl approach led origin discoveri exact distribut complex analysi metho error resili lz data compress algorithm analysi experi abstract propos joint sourc channel code algorithm capabl correct error popular lempel ziv lz scheme introduc measur degrad compress perform achiev lz encod complet elimin redund present input sequenc sourc redund observ lz phrase multipl match case lz issu pointer match choic carri addit bit inform call scheme embed redund inform lz algorithm analyz number longest match scheme prove logarithm seri distribut ia fluctuat sourc entropi distribut number redund bit concentr highli assess signific connect conserv protein interact network comput compar analysi protein protein interact ppi network enabl understand modular organ cell identif function modul protein complex analysi techniqu gener reli topolog featur connected base premis function relat protein interact dens interact follow similar evolutionari trajectori signific recent work lab lab focus effici algorithm identif modul conserv applic method varieti network yield biolog insight spite algorithm advanc develop comprehens infrastructur interact databas rel infanc compar sequenc analysi tool blast clustal critic compon infrastructur measur statist signific match dens subcompon sequenc base measur valu kei compon sequenc match tool absenc analyt measur convent method reli comput simul base ad hoc model quantifi signific paper present effort knowledg aim analyt quantifi statist signific error dresili lzw data compress assess signific connect conserv protein interact network comput compar analysi protein protein interact ppi network enabl understand modular organ cell identif function modul protein complex analysi techniqu gener reli topolog featur connected base premis function relat protein interact dens interact follow similar evolutionari trajectori signific recent work lab lab focus effici algorithm identif modul conserv applic method varieti network yield biolog insight spite algorithm advanc develop comprehens infrastructur interact databas rel infanc compar sequenc analysi tool blast clustal critic compon infrastructur measur statist signific match dens subcompon sequenc base measur valu kei compon sequenc match tool absenc analyt measur convent method reli comput simul base ad hoc model quantifi signific paper present effort knowledg aim analyt quantifi statist signific prefac part seri studi support california governor advisori committe educ excel prefac list figur iv multicast tree structur power law abstract paper investig structur properti multicast tree give rise call multicast power law law assert ratio averag number link multicast tree connect sourc destin averag number link unicast path sati es asymptot cn lt lt order obtain insight rst analyz simpl multicast tree topolog appropri chosen paramet give rise multicast power law asymptot analysi case dif cult infer valid power law observ graph introduc metric reachabl degr easi measur applic gener network multicast tree construct subtre span tree call global multicast tree reachabl degre indic structur global multicast tree show metric reliabl mean infer valid power law final perform experi real simul network demonstr metric hidden word statist sequenc comparison problem hidden pattern problem search subsequ text string understood sequenc consecut symbol characterist paramet pairwis align protein interact network increas amount data protein protein interact ppi network research reveal network evolv modular level discoveri conserv pattern network import problem data protein protein interact limit recent develop algorithm shown convei biolog insight employ eleg mathemat model main challeng align ppi network defin graph theoret measur similar graph structur captur underli biolog phenomena accur respect model conserv diverg interact interpret result align import design paramet paper develop framework comprehens align ppi network inspir duplic diverg model focu understand evolut protein interact propos mathemat model extend concept match mismatch gap sequenc align match mismatch duplic network align evalu similar graph structur score function account evolutionari event reli evolutionari model propos framework facilit interpret result align term conserv diverg modular ppi network case sequenc align model flexibl adjust paramet quantifi underli evolutionari relationship base propos model formul ppi network align optim problem present fast algorithm solv problem detail experiment result implement propos framework show algorithm discov conserv interact pattern effect term accuraci comput cost kei word protein protein interact network align evolutionari model detect conserv interact pattern biolog network molecular interact data plai import role understand biolog process modular level provid framework understand cellular organ function hierarchi evolutionari conserv qualiti quantiti network interact data increas rapidli problem effect analyz data signific graph theoret formal commonli analysi task lead computation hard problem due relat subgraph isomorph paper present innov algorithm mule detect frequent occur pattern modul biolog network innov graph simplif techniqu base ortholog contract ideal suit biolog network algorithm render problem computation tractabl scalabl larg number network show experiment algorithm extract frequent occur pattern metabol pathwai protein interact network kegg dip bind databas second compar exist approach graph simplif techniqu view prune heurist close relat computation simpler task prune heurist show techniqu reduc effect graph size significantli acceler exist techniqu order magnitud test case exist techniqu appli prune step stand analysi techniqu mule shown convei signific biolog insight interact rate softwar sampl input graph detail result comprehens analysi eukaryot ppi network www cs purdu home koyuturk mule kei word graph mine frequent subgraph discoveri evolut modular conserv find biclust random project abstract matrix compos symbol biclust submatrix obtain remov row column row left read string paper concern problem find biclust largest area larg matrix problem prove np complet present fast effici random algorithm discov largest biclust random project detail probabilist analysi algorithm asymptot studi statist signific solut report result extens simul synthet data find biclust random project abstract matrix compos symbol biclust submatrix obtain remov row column row left read string paper concern problem find biclust largest area larg matrix problem prove np complet present fast effici random algorithm discov largest biclust random project detail probabilist analysi algorithm asymptot studi statist signific solut report result extens simul synthet data enumer binari tree lempel dziv pars univers type abstract binari unlabel order tree call binarytre studi euler enumer number tree node isnow catalan number year interest question statist suchtre investig height path length distribut randomli select tree binarytre find abund applic comput scienc recent seroussi pose andinterest problem motiv inform theori consider binari tree givenpath length sum depth question aros studi univers type sequenc seroussi declar sequenc length haveth univers type gener set phrase increment pars lempel ziv scheme prove sequenc type converg empir distribut turn number distinct type sequenc length correspond number ofbinari unlabel order tree tp pathlength number lempel ziv pars length sequenc show thatth number binari tree path length pi asymptot equal tp log weestablish limit distribut number node number phrase lempel ziv scheme tree select randomli tp tree method analyt algorithm pairwis local align protein interact network guid model evolut abstract increas amount data proteinprotein interact ppi network research reveal network evolv modular level discoveri conserv pattern network import problem recent algorithm align ppi network target simplifi structur conserv pathwai render problem computation tractabl conserv structur part function modul protein complex gener correspond dens subnet network algorithm extract conserv pattern term gener graph motiv focu discov protein set induc subnet highli conserv interactom pair speci purpos develop framework formal defin pairwis local align problem ppi network model problem graph optim problem present fast algorithm problem order captur underli biolog process correctli base framework duplic diverg model focu understand evolut ppi network experiment result implement propos framework show algorithm discov conserv interact pattern effect term accuraci comput cost focu pairwis local align ppi network paper propos algorithm easili adapt find match subnet queri databas ppi network markov model identif signific episod complet character partial fillup search time lc enumer binari tree univers type binari unlabel order tree call binari tree studi euler enumer number tree node catalan number year interest question statist tree investig height path length distribut randomli select tree binari tree find abund applic comput scienc recent seroussi pose interest problem motiv inform theori consider binari tree path length sum depth question aros studi univers type sequenc sequenc length univers type gener set phrase increment pars lempel ziv scheme prove sequenc converg empir distribut turn number distinct type sequenc length correspond number binari unlabel order tree tp path length number distinct lempel ziv pars length sequenc show number binari tree path length asymptot equal tp log log establish limit distribut number node number phrase lempel ziv scheme tree select randomli tree path length method analyt algorithm gener function complex asymptot optim dna segment base mdl principl biolog world highli stochast inhomogen behavior region dna high concentr base stretch sequenc abund cg dinucleotid cpg island code region strong periodicityof pattern transit homogen inhomogen region dna chang point carri import biolog inform comput method identifi homogen region call segment reliabl detect episod event sequenc suppos detect bad suspici subsequ event sequenc observ pattern activ form subsequ signi alarm depend occur fortuit long sequenc observ event subsequ set threshold alarm import issu monitor system seek avoid fals alarm suppos long sequenc observ event suspici subsequ pattern suspici subsequ consist event span window size address fundament problem number occurr subsequ gener random indic suspici activ probabl occurr gener random high autom monitor system ag suspici system suer gener fals alarm paper quanti es probabl occur window size number distinct window subsequ expect number occurr varianc establish limit distribut set alarm threshold probabl fals alarm small report experi con rming theori show detect bad subsequ low fals alarm rate probabilist behavior asymmetr level compress analysi random select algorithm motiv lz scheme find biclust random project abstract matrix compos symbol biclust submatrix obtain remov row column row left read string paper concern problem find biclust largest area larg matrix problem prove np complet present fast effici random algorithm discov largest biclust random project detail probabilist analysi algorithm asymptot studi statist signific solut report result extens simul synthet data averag sequenc complex paper studi averag behavior number distinct substr text size alphabet cardin quantiti call complex index captur rich languag sequenc sequenc low complex index larg number repeat substr eventu period tandem repeat dna sequenc order identifi unusu low high complex string determin complex string studi averag maximum string complex maximum string complex studi extens past knowledg result averag complex prove sequenc gener mix model includ markov sourc averag complex asymptot equal amp coincid maximum string complex memoryless sourc establish precis result averag string complex amp log amp gamma ln amp phi log amp gamma amp asymp amp phi period function small amplitud small alphabet size biclust gene dfeatur matric statist signific dens pattern biclust import problem aris divers applic includ analysi gene express drug interact data problem formal wai interpret data optim function focu problem find unusu dens pattern binari matric formul analyz experiment dataset binari quantiz gene express data comprehens dataset gene featur matric includ function code protein motif code sequenc formal notion unusu dens submatrix evalu interesting pattern term statist signific base assumpt uniform memoryless sourc simplifi assess statist signific discov pattern statist signific object function formul problem find signific dens submatric larg spars matrix adopt simpl iter heurist random initi techniqu deriv fast algorithm discov binari biclust conduct experi binari gene featur matrix quantiz breast tumor gene express matrix experiment result show propos method quickli discov interest pattern dataset entropi hidden markov process studi entropi rate binari hidden markov process hmp defin observ output binari symmetr channel input order binari markov process simplic model involv character entropi long stand open problem present probabl sequenc model product random matric show entropi rate sought top lyapunov expon product explain di culti explicit comput appli product random matric deriv explicit express order taylor approxim entropi rate respect paramet binari symmetr channel accuraci approxim valid empir simul result extend result renyi entropi order averag sequenc complex paper studi averag behavior number distinct substr text size alphabet cardin quantiti call complex index captur rich languag sequenc sequenc low complex index larg number repeat substr eventu period tandem repeat dna sequenc order identifi unusu low high complex string determin complex string studi averag maximum string complex maximum string complex studi extens past knowledg result averag complex prove sequenc gener mix model includ markov sourc averag complex asymptot equal amp coincid maximum string complex memoryless sourc establish precis result averag string complex amp log amp gamma ln amp phi log amp gamma amp asymp amp phi period function small amplitud small alphabet size detect signific set episod event sequenc present method reliabl detect unusu set episod form pattern sequenc scan simultan occurr subsequ larg event stream window size investig import special case permut sequenc model situat order event episod matter event correspond purchas market basket item order build reliabl monitor system compar obtain measur refer model case probabilist model bernoulli markov present precis analysi lead construct threshold difficulti carri probabilist analysi arbitrari set pattern stem effici algorithm detect frequent subgraph biolog network rapidli increas amount network interact data molecular biologi problem effect analyz data import graph theoret formal commonli analysi task lead computation hard problem due relat subgraph isomorph paper present innov algorithm detect frequent occur pattern modul biolog network innov graph simplif techniqu ideal suit biolog network algorithm render problem computation tractabl show experiment algorithm extract frequent occur pattern metabol pathwai extract kegg databas second propos model algorithm applic varieti biolog network directli minor modif implement propos algorithm program languag open sourc http www cs purdu home koyuturk pathwai special issu analysi algorithm precis minimax redund regret recent year resurg interest redund lossless code redund regret univers xed variabl length code class sourc determin actual code length exce optim ideal class code length minimax scenario nd code worst sourc worst case call maxim minimax averag rst studi worst case minimax redund class stationari ergod sourc replac shtarkov bound exact formula prove gener shannon code minim worst case redund deriv asymptot redund establish gener properti obtain precis redund rate memoryless markov renew sourc deriv exact constant redund rate memoryless markov sourc show integ natur code contribut log log log size alphabet deal averag minimax redund regret approach markov type minimax redund markov sourc redund univers code class sourc determin actual code length exce optim code length minimax scenario design code worst sourc class minimax redund flavor averag individu sequenc maxim worst case minimax redund studi maxim minimax redund univers block code markovian sourc order prove maxim minimax redund markov sourc order asymptot equal log log ln ln ln length sourc sequenc size alphabet explicit constant find binari alphabet markov order constant catalan number unlik previou attempt view redund problem asymptot evalu sum set matric repres markov type enumer markov type accomplish reduc count eulerian path multigraph propos asymptot formula number string markov type find obtain analyt combinatori tool analysi algorithm index term minimax redund markov sourc markov type eulerian path multidimension gener function analyt inform theori preliminari version paper present colloquium mathemat comput scienc algorithm tree combinator probabl versail problem sequenc inform theori comput scienc interfac markov type minimax redund markov sourc redund univers code class sourc determin actual code length exce optim code length minimax scenario design code worst sourc class minimax redund flavor averag individu sequenc maxim worst case minimax redund studi maxim minimax redund univers block code markovian sourc order prove maxim minimax redund markov sourc order asymptot equal log log ln ln ln length sourc sequenc size alphabet explicit constant find binari alphabet markov order constant catalan number unlik previou attempt view redund problem asymptot evalu sum set matric repres markov type enumer markov type accomplish reduc count eulerian path multigraph propos asymptot formula number string markov type find obtain analyt combinatori tool analysi algorithm index term minimax redund markov sourc markov type eulerian path multidimension gener function analyt inform theori preliminari version paper present colloquium mathemat comput scienc algorithm tree combinator probabl versail number full level averag sequenc complex paper studi averag behavior number distinct substr text size alphabet cardin quantiti call complex index captur rich languag sequenc sequenc low complex index larg number repeat substr eventu period tandem repeat dna sequenc order identifi unusu low high complex string determin complex string studi averag maximum string complex maximum string complex studi extens past knowledg result averag complex prove sequenc gener mix model includ markov sourc averag complex asymptot equal amp coincid maximum string complex memoryless sourc establish precis result averag string complex amp log amp gamma ln amp phi log amp gamma amp asymp amp phi period function small amplitud small alphabet size optim dna segment base mdl principl biolog world highli stochast inhomogen behavior region dna high concentr base stretch sequenc abund cg dinucleotid cpg island code region strong periodicityof pattern transit homogen inhomogen region dna chang point carri import biolog inform comput method identifi homogen region call segment algorithm bound derror correl high dimension data microarrai experi problem cluster continu valu data studi literatur applic microarrai analysi reli algorithm mean dimension reduct techniqu graph base approach build dendrogram sampl data contrast similar problem discret attribut data unexplor instanc analysi discret attribut data aris detect regul sampl microarrai paper present algorithm softwar framework proximu error bound cluster highdimension discret attribut dataset context extract regul sampl microarrai data show proximu deliv outstand perform extract accur pattern gene express joint sourc dchannel lz code reliabl detect episod event sequenc suppos detect bad suspici subsequ event sequenc observ pattern activ form subsequ signi alarm depend occur fortuit long sequenc observ event subsequ set threshold alarm import issu monitor system seek avoid fals alarm suppos long sequenc observ event suspici subsequ pattern suspici subsequ consist event span window size address fundament problem number occurr subsequ gener random indic suspici activ probabl occurr gener random high autom monitor system ag suspici system suer gener fals alarm paper quanti es probabl occur window size number distinct window subsequ expect number occurr varianc establish limit distribut set alarm threshold probabl fals alarm small report experi con rming theori show detect bad subsequ low fals alarm rate analysi algorithm aofa part ii princeton dbarcelona dgdansk articl continu previou algorithm column eatc dedic activ analysi algorithm group dagstuhl period rst meet place schloss dagstuhl germani improv behaviour symmetr sourc paper propos studi pre process techniqu improv perform digit tree trie base search algorithm asymmetr memoryless sourc techniqu call symmetr sourc biject map sequenc symbol origin asymmetr sourc symbol output alphabet result uniform distribut introduc criterion effici map demonstr problem find optim sourc univers symmetr transform equival problem construct minimum redund variabl length block code sourc class sourc base result semi ddiscret matrix transform sdd imag video compress wide varieti matrix transform compress imag video data transform motion estim quantiz transform singularvalu decomposit svd reli low rank approxim matrix comput storag ecienc paper describ variant svd imag video compress variant rst propos peleg leari call semi discret decomposit sdd restrict element outer product vector approxim higher rank store amount storag demonstr superior sdd svd varieti compress scheme show dct base compress superior sdd base compress demonstr sdd facilit fast accur pattern match motion estim present excel opportun improv compress introducti gener shannon code minim maxim redund sourc code data compress area inform theori deal design perform evalu optim code data compress huffman construct optim code minim averag code length prefix code sourc huffman code minim averag redund defin differ code length entropi sourc interestingli optim code popular optim criterion maxim redund defin maximum pointwis redund sourc sequenc prove gener shannon code minim maxim redund prefix code present effici implement optim code comput precis redund memoryless sourc final studi univers code unknown sourc distribut adopt minimax approach search code worst sourc establish redund sum likelihood estim redund gener code comput maximum likelihood distribut replac shtarkov bound exact formula comput precis maxim minimax class memoryless sourc main find paper establish techniqu belong toolkit analyt analysi algorithm theori distribut sequenc modulo fourier seri method found applic problem inform theori constitut call analyt inform theori internet fractal main bene ts multicast commun reduct network load quantifi reduct compar tradit unicast experiment studi chuang sirbu call power law assert number link multicast deliveri tree connect sourc distinct site order explain theoret behavior phillip shenker tangmunarunkit examin approxim link number ari complet tree topolog conclud number grow linearli obei power law rst examin analysi phillip al provid precis asymptot expans link number con rm linear wobbl growth claim essenc problem li model assumpt replac ari complet tree topolog byav ari similar tree similar factor tree node level replic cv time depth tree constant assumpt analyz prove cm explicitli comput constant similar tree provid plausibl explan multicast power law examin gener condit gener tree power law hold discuss experiment result real network rea rm power law show network gener condit hold dpattern match imag video compress theori analyt variat redund rate renew process csisz ar shield recent prove minimax redund class stationari renew process block length interest result trivial bound redund parametr famili process present paper precis estim redund rate nonstationari renew sourc log asymptot expans deriv complex analyt method includ gener function represent mellin transform singular analysi saddl point estim work place framework analyt inform theori univers predictor base pattern match optim versu random search fix length binari word search problem nd binari word word chosen randomli set word xed length optim search equival human code requir averag log bit check small addit cost call averag redund oscil function bound ln ln ln matter fact nding optim strategi problem np hard propos simpl random search strategi lead averag redund small oscil character precis result compar optim np hard search algorithm nding extend make precis recent result fedotov ryabko obtain analyt method gener function mellin transform analyt depoisson limit law height patricia height binari search tree limit distribut perspect studi height binari search tree fundament data structur search assum binari search tree built random permut element assumpt studi limit distribut height show distribut asymptot region scale correspond rang prfh kg height distribut critic region call central region probabl mass concentr limit distribut satisfi linear integr equat solv equat show tail distribut roughli doubl exponenti form analysi conclud averag height log gamma real dtime decompress stream video mobil code averag dcase analysi algorithm prefac hidden pattern statist fundament problem combinator word string manipul string match sequenc comparison string match search occurr string understood sequenc consecut symbol text sequenc comparison subsequ string search text string match problem extens studi literatur algorithm probabilist point view sequenc comparison problem hidden pattern problem harder investig paper studi number occurr pattern length subsequ random text length gener memoryless sourc version problem unconstrain subsequ text constrain put bound distanc symbol word determin varianc number occurr establish gaussian limit law result obtain combinator word formal languag method analyt combinator base gener function moment method motiv studi problem attempt find reliabl threshold intrus detect textual data process applic molecular biologi averag dcase analysi algorithm prefac averag profil lempel dziv pars scheme markovian sourc markovian sourc analyz lempel ziv pars scheme partit sequenc phrase phrase shortest phrase past model markov independ model sequenc gener independ markovian sourc ith phrase shortest prefix ith sequenc phrase prefix previou gamma sequenc model singl sequenc gener markovian sourc model coin gilbert kadota model fix number phrase gener lempel ziv algorithm produc sequenc variabl random length model lempel ziv model string fix length partit variabl random number phrase model effici repres analyz digit search tree interest al averag redund rate lempel dziv code derror protocol paper examin averag redund rate lempel ziv code error protocol storer reif studi modif lempel ziv scheme show effici protect error propag preserv asymptot optim code refin result provid asymptot express averag redund rate code memoryless sourc analyt method establish result exploit relationship pars scheme lempel ziv encod error protocol gener digit search tree structur accompani analysi number experi test valid theoret result demonstr effect addit modif lempel ziv algorithm averag redund rate lempel dziv code derror protocol paper examin averag redund rate lempel ziv code error protocol storer reif studi modif lempel ziv scheme show effici protect error propag preserv asymptot optim code refin result provid asymptot express averag redund rate code memoryless sourc analyt method establish result exploit relationship pars scheme lempel ziv encod error protocol gener digit search tree structur accompani analysi number experi test valid theoret result demonstr effect addit modif lempel ziv algorithm summari structur frequenc queri larg transact set larg scale databas commonplac signific interest mine commerci purpos basic task underli mine oper queri transact set frequenc attribut valu size databas make import develop summari structur capabl high compress ratio support fast frequenc queri natur problem differ respect tradit text compress high compress ratio paper propos binari trie base summari structur repres transact set demonstr trie structur augment set horizont pointer support frequenc queri order magnitud faster raw transact data improv memori characterist scheme compress trie patricia trie demonstr height gener patricia height digit search tree longest phrase lempel dziv scheme height digit search tree longest phrase lempel dziv scheme note asymptot behavior height dtri larg studi limit distribut height gener trie extern node capabl store item call assum tree built random string item gener unbias memoryless sourc paper discuss case larg identifi region height distribut compar region obtain fix prove limit distribut concentr singl point log observ height distribut fix case limit distribut extrem type concentr log deriv result analyt method gener function saddl point method present numer verif result asymptot averag redund huffman block code asymptot behavior height digit search tree longest phrase lempel dziv scheme dpattern match imag video compress paper present lossi data compress scheme base approxim dimension pattern match pmic extens lempel ziv lossless scheme appli scheme imag video compress report theoret experiment result theoret show call fix databas model lead suboptim compress compress ratio model low gener entropi defin paper model video compress scheme present experiment result imag compress grow databas model provid approxim analysi present final version paper implement pmic challeng problem algorithm point view rang techniqu data structur tree gener run length code adapt arithmet code variabl adapt maximum distort level achiev good compress ratio high compress speed demonstr bit rate rang gamma bpp high qualiti imag data rate rang gamma mbp video compress quicksort algorithm revisit paper establish integr equat probabl densiti number comparison investig larg deviat show left tail limit distribut thinner doubl exponenti tail exponenti result constant determin numer formal asymptot method appli mathemat wkb method match asymptot keyword algorithm analysi algorithm asymptot analysi binari search tree quicksort sort introduct pattern match imag compress algorithm empir result entropi comput analyt depoisson investig basic question inform theori evalu shannon entropi gener nyi entropi discret distribut binomi neg binomi aim establish analyt method complex analysi plai pivot role comput yield estim unparallel precis main analyt tool analyt poisson depoisson illustr approach entropi evalu binomi distribut prove binomi distribut entropi ln ln gamma gammak explicitli comput constant argu analyt method complex asymptot rice method singular analysi mellin transform poisson depoisson offer tool inform theori studi index map protein modifi nonlinear sammon project modifi sammon algorithm develop displai relationship protein base amino acid composit stage method dimension composit space repres protein map dimension space origin sammon project creat contour map stage contour map refer protein project data analysi show protein belong structur class form characterist distinct cluster potenti predict protein structur class observ signific overlap cluster explain limit success previou protein fold predict base sole amino acid composit modifi sammon project gener uniqu index individu project protein relat amino acid composit tool exploratori classif protein averag profil gener digit search tree gener lempel dziv algorithm goal research threefold analyz gener digit search tree ii deriv averag profil phrase length gener pars algorithm due lempel ziv iii provid analyt tool analyz asymptot partial differenti function equat aris analysi digit tree gener lempel ziv pars scheme partit sequenc symbol finit alphabet phrase phrase shortest substr past gamma phrase correspond origin lempel ziv scheme scheme analyz gener digit search tree node capabl store string paper investig depth randomli select node tree length randomli select phrase gener lempel ziv scheme find recent result al complex sequenti pattern match algorithm formal defin class sequenti pattern match algorithm includ variat morri pratt algorithm twenti year complex algorithm bound linear function text length recent substanti progress made identifi lower bound prove exist asymptot linear constant worst averag case subaddit ergod theorem prove converg result hold pattern text stationari ergod pattern text proof establish structur properti exist unavoid posit algorithm stop compar properti uniqu reserv morri pratt type algorithm observ popular pattern match algorithm propos boyer moor possess properti keyword string search pattern match anali quicksort revisit greedi algorithm shortest common superstr asymptot optim recent resurg interest shortest common superstr problem due import applic molecular biologi recombin dna data compress problem np hard time greedi algorithm work problem precis prove recent sequenc paper worst case greedi algorithm produc superstr fi time fi wors optim analyz problem probabilist framework optim total overlap opt overlap gr produc greedi algorithm turn asymptot equival show high probabl lim opt log lim gr log number origin string entropi underli alphabet result hold condit length string short philipp flajolet research analysi algorithm combinator pattern frequenc occurr markovian sequenc pattern random text gener markovian sourc studi frequenc pattern occurr random text overlap copi pattern count separ present exact asymptot formula moment includ varianc probabl pattern occurr region ii central limit regim iii larg deviat regim order deriv result construct languag express character pattern occurr translat gener function final analyt method extract asymptot behavior pattern frequenc applic result includ molecular biologi sourc code synchron wireless commun approxim pattern match game theori stock market analysi find interest inform theori order properti analyt depoisson applic stabil analysi quota alloc access protocol ring network spatial reus slot ring simultan transmiss messag node ring spatial reus allevi fair problem aris network polici propos oper cycl guarante number packet exceed number call quota transmit node cycl paper provid suffici stabil condit implicitli character stabil region ring condit deriv extend techniqu develop network queue satisfi monoton properti approach instabl peculiar properti deriv instabl domin system interestingli stabil region depend entir distribut messag arriv process steadi state averag cycl length lower dimension system lead region nonlinear boundari exact comput gener intract introduc notion essenti absolut stabil region arriv rate vector belong region system stabl arriv distribut arriv vector belong exist distribut rate vector system stabl linear program approach deriv bound stabil region depend condit averag cycl length case node provid close form express essenti stabil region analysi asymmetr leader elect algorithm leader elect algorithm set distribut object peopl comput identifi object leader elect process random stage algorithm object surviv flip bias coin receiv tail surviv round process continu object remain interest evalu limit distribut moment number round need select leader establish precis asymptot moment show asymptot express durat algorithm exhibit period fluctuat limit distribut exist result prove analyt techniqu precis analysi algorithm analyt poisson depoisson mellin transform complex analysi averag redund rate lempel dziv code paper settl long stand open problem averag redund lempel ziv lz code prove memoryless sourc averag redund rate attain asymptot er ffi log log log log explicitli constant depend sourc characterist ffi fluctuat function small amplitud deriv lead term kth moment number phrase conclud conjectur precis formula expect redund markovian sourc main result paper consequ recent obtain order properti lempel ziv algorithm jacquet szpankowski theoret comput scienc find establish analyt techniqu precis analysi algorithm give survei result interest shed light pro stabil analysi quota alloc access protocol ring network spatial reus slot ring simultan transmiss messag node ring spatial reus allevi fair problem aris network polici propos oper cycl guarante number packet exceed number call quota transmit node cycl paper provid suffici stabil condit implicitli character stabil region ring condit deriv extend techniqu develop network queue satisfi monoton properti approach instabl peculiar properti deriv instabl domin system interestingli stabil region depend entir distribut messag arriv process steadi state averag cycl length lower dimension system lead region nonlinear boundari exact comput gener intract introduc notion essenti absolut stabil region arriv rate vector belong region system stabl arriv distribut arriv vector belong exist distribut rate vector system stabl linear program approach deriv bound stabil region depend condit averag cycl length case node provid close form express essenti stabil region suboptim lossi data compress base approxim pattern match practic suboptim variabl sourc code algorithm lossi data compress present scheme base approxim string match natur extend lossless lempel ziv data compress scheme typic length approxim repeat pattern posit stationari mix sequenc mismatch allow prove exist constant length approxim repeat pattern converg probabl log pr sure oscil gamma log log gamma constant constant natur gener enyi entropi lossi environ importantli show compress ratio lossi data compress scheme base approxim pattern match asymptot equal establish asymptot correct suboptim lossi data compress base approxim pattern match analysi algorithm empir success spectral cluster method algorithm cluster point eigenvector matric deriv distanc point unresolv issu wide varieti algorithm eigenvector slightli wai algorithm proof comput reason cluster paper present simpl spectral cluster algorithm implement line matlab tool matrix perturb theori analyz algorithm give condit expect show surprisingli good experiment result number challeng cluster problem pattern match imag compress averag redund rate lempel dziv code paper settl long stand open problem averag redund lempel ziv lz code prove memoryless sourc averag redund rate attain asymptot er ffi log log log log explicitli constant depend sourc characterist ffi fluctuat function small amplitud deriv lead term kth moment number phrase conclud conjectur precis formula expect redund markovian sourc main result paper consequ recent obtain order properti lempel ziv algorithm jacquet szpankowski theoret comput scienc find establish analyt techniqu precis analysi algorithm give survei result interest shed light pro analysi split process aris probabilist count relat algorithm present analyt method analyz class split algorithm includ probabilist count select leader estim number question identifi distinct object search algorithm base digit approxim count discuss concentr analysi gener probabilist count algorithm techniqu belong toolkit analyt analysi algorithm involv solut function equat analyt poisson depoisson mellin transform deal instanc function equat fia function fi constant respect gener probabilist count algorithm obtain asymptot expans moment estim cardin set comput algorithm deriv asymptot distrib greedi algorithm shortest common superstr asmtot optim pattern occurr random text pattern random text length assum symbol text occur independ symbol probabl occurr call asymmetr bernoulli model concern probabl occurr text deriv gener function probabl show asymptot behav ffn ae gammar gamma ff explicitli comput constant ae root equat depend structur pattern extend find random pattern kei word pattern occurr bernoulli model autocorrel polynomi gener function asymptot analysi research author support nsf grant ccr ncr nato collabor grant cgr introduct repeat pattern relat phenomena word sequenc string plai central role facet analysi split process aris probabilist count relat algorithm present analyt method analyz class split algorithm includ probabilist count select leader estim number question identifi distinct object search algorithm base digit approxim count discuss concentr analysi gener probabilist count algorithm techniqu belong toolkit analyt analysi algorithm involv solut function equat analyt poisson depoisson mellin transform deal instanc function equat fia function fi constant respect gener probabilist count algorithm obtain asymptot expans moment estim cardin set comput algorithm deriv asymptot distrib gener lempel dziv pars scheme preliminari analysi averag profil probabilist analysi string edit problem variat string edit problem probabilist framework problem consider interest facet scienc notabl molecular biologi comput scienc string edit transform string perform seri weight edit oper maximum minimum cost problem equival find optim path weight grid graph paper provid result typic behavior path observ optim path edit distanc sure equal ffn larg ff constant sum length string importantli show edit distanc concentr averag call independ model weight grid graph statist independ deriv bound constant ff product result present precis estim averag profil limit distribut phrase size lempel dziv pars algorithm pars algorithm due lempel ziv partit sequenc length variabl phrase block block shortest substr past phrase practic paramet interest number phrase size phrase number phrase size paper focu size randomli select phrase averag number phrase size call averag profil phrase size paramet effici analyz digit search tree represent memoryless sourc unequ probabl symbol gener call asymmetr bernoulli model prove size typic phrase asymptot distribut varianc explicitli comput term digit search tree prove normal limit distribut typic depth length path root lossi data compress base string match preliminari analysi suboptim algorithm practic suboptim algorithm sourc code lossi faith data compress discuss scheme base approxim string match natur extend lossless faith lempel ziv data compress scheme construct algorithm base care probabilist analysi approxim string match problem interest extend wyner ziv model lossi environ confer version bernoulli model memoryless channel result hold weaker probabilist assumpt introduct repeat pattern relat phenomena word sequenc string plai central role facet telecommun theoret comput scienc notabl code theori data compress theori formal languag design analysi algorithm faith data compress repeat subsequ reduc asymptot sum aris code theori recent kl ve ieee analyz averag worst case probabl undetect error linear code length dimens alphabet size sum gamma delta gamma gammai aros applic code theori averag case analysi algorithm combinator kl ve conjectur asymptot expans sum prove enhenc version note challeng sum aris upper bound averag worst case probabl undetect error systemat code deriv massei gamma gammak delta gamma gammai obtain asymptot expans lead conclus massei bound averag worst case probabl systemat code kl ve bound schedul polici maxim stabil region ring network spatial reus slot ring simultan transmiss messag user consid ring network commonli call ring spatial reus achiev significantli higher throughput standard token ring rais issu fair node prevent access ring long time interv polici oper cycl guarante number quota packet transmit node cycl consid deal fair issu paper address problem design polici result stabl system end end arriv rate stabil region ring spatial reus stabil region ring defin set end end arriv rate polici make ring stabl provid polici requir knowledg end end arriv rate polici adap asymptot behavior lempel dziv pars scheme digit search tree lempel ziv pars scheme find wide rang applic notabl data compress algorithm word partit sequenc length variabl phrase phrase shortest substr past phrase paramet interest number phrase construct sequenc length paper memoryless sourc unequ probabl symbol gener deriv limit distribut turn normal prove long stand open problem fact obtain result solv open problem establish limit distribut intern path length digit search tree consequ asymptot solut multipl differenti function equat aris analysi algorithm word interestingli find prove combin probabilist techniqu renew equat uniform integr analyt techniqu mellin transform differenti function equat de poisson conclud remark possibl extend result markovian model lossi data compress base string match preliminari analysi suboptim algorithm practic suboptim algorithm sourc code lossi faith data compress discuss scheme base approxim string match natur extend lossless faith lempel ziv data compress scheme construct algorithm base care probabilist analysi approxim string match problem interest extend wyner ziv model lossi environ confer version bernoulli model memoryless channel result hold weaker probabilist assumpt introduct repeat pattern relat phenomena word sequenc string plai central role facet telecommun theoret comput scienc notabl code theori data compress theori formal languag design analysi algorithm faith data compress repeat subsequ reduc function equat aris analysi algorithm extend abstract autocorrel word applic analysi suffix tree string druler approach studi probabilist framework topic word overlap probabilist model assum word sequenc symbol gener finit alphabet defin call bernoulli model investig length subword recopi subword occur word occurr repeat substr easi detect digit tree call suffix tree length repeat substr correspond typic depth suffix tree main find show typic depth suffix tree asymptot distribut manner typic depth digit tree store independ kei independ precis prove typic depth suffix tree built suffix random word distribut asymptot log varianc ff delta log digit search tree revisit intern path length perspect analysi string edit problem probabilist framework extend abstract asymptot properti data compress suffix tree recent wyner ziv prove typic length repeat subword found posit stationari ergod sequenc log probabl entropi alphabet find obtain insight univers data compress scheme notabl lempel ziv data compress algorithm wyner ziv conjectur result extend stronger converg paper settl conjectur neg call domain asymptot dynam phase expand data base prove addit assumpt involv mix condit length typic repeat subword oscil sure log log show length nth block lempel ziv pars algorithm reveal similar behavior relat find note binomi recurr aris analysi algorithm multidimension digit search paramet multidimension digit search analyz view point partial match retriev result extend analysi flajolet puech averag cost retriev bernoulli model bias probabl symbol occurr kei main find concern varianc cost retriev unbias case varianc order gamma number record store trie number compon queri size present detail analysi varianc identifi constant analysi central part paper requir seri transform ident back ramanujan appendix provid mellin transform approach result work support fond zur forderung der wissenschaftlichen forschung project tec support research pr probabilist analysi pattern match problem studi comparison string symbol finit infinit alphabet relev area scienc notabl molecular biologi speech recognit comput scienc problem find minimum distanc string gener block data great import paper investig string pattern match problem probabilist framework assum string form independ sequenc symbol text string length pattern string length maximum number match substr main probabilist result show gamma mp theta log probabl pr provid log probabl match symbol string alphabet symmetr symbol occur probabl stronger result hold na gener suffix tree expect asymptot behavior suffix tree find applic comput scienc telecommun notabl algorithm string data compress code typic behavior probabilist framework famili suffix tree call suffix tree built suffix random word famili noncompact suffix tree edg label singl symbol repres compact suffix tree unari node asymptot equival studi paramet suffix tree depth suffix depth insert height shortest feasibl path result typic behavior paramet establish find obtain insight algorithm word molecular biologi univers data compress scheme kei wo limit distribut depth patricia probabilist analysi gener suffix tree extend abstract pattern match mismatch probabilist analysi random algorithm extend abstract count quickli accur unifi analysi probabilist count relat problem expect behavior typic suffix tree dalign word applic quantiti period word analyz bernoulli probabilist model problem address assum string symbol emit randomli independ distribut probabl pair distinct suffix expect length longest common prefix sought collect length call align plai crucial role algorithm problem word build suffix tree invert file detect squar regular comput substr statist asymptot algorithm problem complex risk unpract present analysi align relat measur suggest varieti case straightforward algorithm solut yield compar perform kei word ph stabil token pass ring suffici stabil condit standard token pass ring semin paper kuehn condit deriv formal proof proof consider interest research commun fact watson observ perform evalu token pass ring conveni deriv stabil condit proof intent fill gap provid formal proof suffici stabil condit token pass ring paper present case arriv process queue poisson servic time switchov time gener distribut depth gate limit servic disciplin station basic step techniqu studi stabil multiqueu system keyword phrase token pass ring stabil substabl ergod markov chain note height suffix tree maximum size dynam data structur hash lazi delet revisit studi dynam data structur manag techniqu call hash lazi delet hwld tabl manag hwld built sequenc insert delet item hash lazi delet delet item item data structur delet strategi deferr simpler delet algorithm lead lower overhead space time hwld implement interest extra space hwld investig maximum size excess space hwld gener probabilist assumpt methodolog queue theori find poisson arriv gener life time distribut item excess space exce number bucket hwld product analysi deriv limit distribut maximum queue length jgj queue syst probabilist model data structur word repli professor andersson letter typic behaviour data compress scheme combinatori optim order statist learn suffix tree independ height digit tree relat problem analysi digit markovian depend character digit search tree success search viewpoint analysi tail queue length wait time distribut gi fg fc queue patricia revisit present nest chines restaur process ncrp stochast process assign probabl distribut infinit deep infinit branch tree show stochast process prior distribut bayesian nonparametr model document collect specif present applic inform retriev document model path random tree preferenti attach dynam ncrp lead cluster document share topic multipl level abstract corpu document posterior infer algorithm find approxim posterior distribut tree topic alloc word level tree demonstr algorithm collect scientif abstract journal model exemplifi recent trend statist machin learn bayesian nonparametr method infer distribut flexibl data structur digit search tree result fundament data structur digit data structur order statist remark uniformli bound markov chain multimod analysi presenc exponenti entropi maxim fgi queue varianc extern path length symmetr digit trie ultim character burst respons interv search algorithm studi function equat balanc properti patricia extern path length viewpoint balanc patricia tree extend abstract altern sum analysi data structur close dnetwork dual multiqueu applic token dpass system evalu altern sum applic analysi data structur evalu altern sum applic analysi data structur result dari asymmetr problem averag complex digit tree averag complex addit properti multiwai unifi approach extend abstract analysi content resolut algorithm approach asymptot analysi tree dtype algorithm broadcast commun perform evalu reserv protocol multiaccess system packet switch multipl radio channel analysi stabil random access system 